منابع مشابه
On cyclically embeddable graphs
An embedding of a simple graph G into its complement G is a permutation σ on V (G) such that if an edge xy belongs to E(G), then σ(x)σ(y) does not belong to E(G). In this note we consider some families of embeddable graphs such that the corresponding permutation is cyclic.
متن کاملOn cyclically embeddable (n, n-1)-graphs
An embedding of a simple graph G into its complement G is a permutation σ on V (G) such that if an edge xy belongs to E(G), then σ(x)σ(y) does not belong to E(G). In this note we consider the embeddable (n, n)-graphs. We prove that with few exceptions the corresponding permutation may be chosen as cyclic one.
متن کاملOn cyclically orientable graphs
Graph G is called cyclically orientable (CO) if it admits an orientation in which every simple chordless cycle is cyclically oriented. This family of graphs was introduced by Barot, Geiss, and Zelevinsky in their paper “Cluster algebras of finite type and positive symmetrizable matrices”, J. London Math. Soc. 73 Part 3 (2006), 545-564. The authors obtained several nice characterizations of CO-g...
متن کاملClin d’oeil on Lj-embeddable planar graphs
In this note we present some properties of LI-embeddable planar graphs. We present a characterization of graphs isometrically embeddable into half-cubes. This result implies that every planar Li-graph G has a scale 2 embedding into a hypercube. Further, under some additional conditions we show that for a simple circuit C of a planar Li-graph G the subgraph H of G bounded by C is also Li-embedda...
متن کاملCyclically Orientable Graphs
Barot, Geiss and Zelevinsky define a notion of a “cyclically orientable graph” and use it to devise a test for whether a cluster algebra is of finite type. Barot, Geiss and Zelivinsky’s work leaves open the question of giving an efficient characterization of cyclically orientable graphs. In this paper, we give a simple recursive description of cyclically orientable graphs, and use this to give ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2002
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(01)00339-9